Complexity Information Flow in a Multi-threaded Imperative Language
نویسندگان
چکیده
We propose a type system to analyze the time consumed by multi-threaded imperative programs with a shared global memory, which delineates a class of safe multi-threaded programs. We demonstrate that a safe multi-threaded program runs in polynomial time if (i) it is strongly terminating wrt a non-deterministic scheduling policy or (ii) it terminates wrt a deterministic and quiet scheduling policy. As a consequence, we also characterize the set of polynomial time functions. The type system presented is based on the fundamental notion of data tiering, which is central in implicit computational complexity. It regulates the information flow in a computation. This aspect is interesting in that the type system bears a resemblance to typed based information flow analysis and notions of non-interference. As far as we know, this is the first characterization by a type system of polynomial time multi-threaded programs.
منابع مشابه
Improved typings for probabilistic noninterference in a multi-threaded language
With the variables of a program classified as L (low, public) or H (high, private), the secure information flow problem is concerned with preventing the program from leaking information from H variables to L variables. In the context of a multi-threaded imperative language with probabilistic scheduling, the goal can be formalized as a probabilistic noninterference property. Previous work identi...
متن کاملA New Type System for Secure Information Flow
With the variables of a program classified as (low, public) or (high, private), we wish to prevent the program from leaking information about variables into variables. Given a multi-threaded imperative language with probabilistic scheduling, the goal can be formalized as a property called probabilistic noninterference. Previous work identified a type system sufficient to guarantee probabilistic...
متن کاملSecure Information Flow as Typed Process Behaviour
We propose a new type discipline for the π-calculus in which secure information flow is guaranteed by static type checking. Secrecy levels are assigned to channels and are controlled by subtyping. A behavioural notion of types capturing causality of actions plays an essential role for ensuring safe information flow in diverse interactive behaviours, making the calculus powerful enough to embed ...
متن کاملFlow in a Multi - threaded Imperative
Previously, we developed a type system to ensure secure information ow in a sequential, imperative programming language VSI96]. Program variables are classiied as either high or low security; intuitively, we wish to prevent information from owing from high variables to low variables. Here, we extend the analysis to deal with a multi-threaded language. We show that the previous type system is in...
متن کاملThe Impact of Synchronisation on Secure Information Flow in Concurrent Programs
Synchronisation is fundamental to concurrent programs. This paper investigates the security of information ow in multi-threaded programs in the presence of synchronisation. We give a small-step operational semantics for a simple shared-memory multi-threaded language with synchronisation, and present a compositional timing-sensitive bi-simulation-based conndentiality speciication. We propose a t...
متن کامل